class Solution:
    def findContentChildren(self, g: List[int], s: List[int]) -> int:
        g.sort()
        s.sort()
        count = 0
        length = min(len(g),len(s))
        for i in range(length):
            for j in range(len(s)):
              if g[i] <= s[j]:
                 count += 1
                 del s[j]
                 break
              else:
                count = count
        return count
        print(2 <= 2)